Retracted: Research on Sports Balanced Development Evaluation System Based on Edge Computing and Balanced Game

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

note on edge distance-balanced graphs

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

متن کامل

Remarks on Distance-Balanced Graphs

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.

متن کامل

A Model for Developing the Best Strategy Combination Based on Balanced Scorecard, Fuzzy Net Present Value and Game Theory

Increasing competition has caused that organizations using evaluation, control and performance improvement try to maintain their supremacy in global markets. Balanced Scorecard model is one of the ways that can help organizations achieve this goal. In this study, the limitations of selecting performance criteria and executive strategies in balanced scorecard are discussed and two tools of curre...

متن کامل

Balanced edge colorings

This paper contains two principal results. The first proves that any graph G can be given a balanced proper edge coloring by k colors for any k ≥ χ′(G). Here balanced means that the number of vertices incident with any set of d colors is essentially fixed for each d, that is, for two different d-sets of colors the number of vertices incident with each of them can differ by at most 2. The second...

متن کامل

E ective Balanced Edge Partition Model for Parallel Computing

Graph edge partition models have recently become an appealing alternative to graph vertex partition models for distributed computing due to their exibility in balancing loads and their performance in reducing communication cost [6, 16]. In this paper, we propose a simple yet e ective graph edge partitioning algorithm. In practice, our algorithm provides good partition quality (and better than s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Security and Communication Networks

سال: 2023

ISSN: ['1939-0122', '1939-0114']

DOI: https://doi.org/10.1155/2023/9815696